Evaluating approximations of the semidefinite cone with trace normalized distance
نویسندگان
چکیده
We evaluate the dual cone of set diagonally dominant matrices (resp., scaled matrices), namely $$\mathcal{DD}_n^*$$ $$\mathcal{SDD}_n^*$$ ), as an approximation semidefinite cone. prove that norm normalized distance, proposed by Blekherman et al. [5], between a $$\mathcal{S}$$ and has same value whenever $$\mathcal{SDD}_n^* \subseteq \mathcal{S} \mathcal{DD}_n^*$$ . This implies distance is not sufficient measure to these approximations. As new compensate for weakness we propose called trace distance. $$\mathcal{S}^n_+$$ different from one give exact values distances.
منابع مشابه
Evaluating the Impact of Information Distortion on Normalized Compression Distance
In this paper we apply different techniques of information distortion on a set of classical books written in English. We study the impact that these distortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications...
متن کاملEvaluating the Distance between Posterior Teeth and the Maxillary Sinus Floor Using Cone Beam Computed Tomography
Background and Objectives The topography of the sinus floor and its relationship with maxillary teeth roots varies with age, pneumatization size and grade, positioning of the teeth, and Genetics. This study used cone beam computed tomography (CBCT) to evaluate the distance between posterior teeth and the maxillary sinus floor in patients in Rafsanjan City, Iran. Materials and Methods This de...
متن کاملOn the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings
The structural properties of the completely positive semidefinite cone CS+, consisting of all the n×n symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size, are investigated. This cone has been introduced to model quantum graph parameters as conic optimization problems. Recently it has also been used to characterize the set Q of bipartite quantum corr...
متن کاملSemidefinite approximations of the matrix logarithm
We propose a new way to treat the exponential/relative entropy cone using symmetric cone solvers. Our approach is based on highly accurate rational (Padé) approximations of the logarithm function. The key to this approach is that our rational approximations, by construction, inherit the (operator) concavity of the logarithm. Importantly, our method extends to the matrix logarithm and other deri...
متن کاملSemidefinite Approximations of the Polynomial Abscissa
Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is Hölder continuous, and not locally Lipschitz in general, which is a source of numerical difficulties for designing and optimizing control laws. In this paper we propose simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2022
ISSN: ['1862-4480', '1862-4472']
DOI: https://doi.org/10.1007/s11590-022-01908-3